A note about a partial no-go theorem for quantum PCP
نویسنده
چکیده
This is not a disproof of the quantum PCP conjecture! In this note we use perturbation on the commuting Hamiltonian problem on a graph, based on results by Bravyi and Vyalyi, to provide a partial no-go theorem for quantum PCP. Specifically, we derive an upper bound on how large the promise gap can be for the quantum PCP still to hold, as a function of the non-commuteness of the system. As the system becomes more and more commuting, the maximal promise gap shrinks. We view these results as possibly a preliminary step towards disproving the quantum PCP conjecture posed in [AALV09]. A different way to view these results is actually as indications that a critical point exists, beyond which quantum PCP indeed holds; in any case, we hope that these results will lead to progress on this important open problem.
منابع مشابه
A Novel Design of Reversible Multiplier Circuit (TECHNICAL NOTE)
Adders and multipliers are two main units of the computer arithmetic processors and play an important role in reversible computations. The binary multiplier consists of two main parts, the partial products generation circuit (PPGC) and the reversible parallel adders (RPA). This paper introduces a novel reversible 4×4 multiplier circuit that is based on an advanced PPGC with Peres gates only. Ag...
متن کاملA note on the singularity theorem for supergravity SD-branes
Recently, a singularity theorem for full SD-brane spacetimes was given in hepth/0305055. We comment on the relation between this and previous work as well as provide a more geometric formulation interpreted as a no-go theorem. We then point out that some setups of physical interest escape the theorem: cosmological applications, half-SDp-branes and decaying unstable Dp-branes for general p. We a...
متن کاملAround the Pcp Theorem
jeev Arora, from Princeton, was the guest speaker. The participants thus had a unique occasion to hear about what is arguably the most spectacular result in the history of computational complexity from someone who was deeply involved in its development. Many thanks to the note-takers, and very, very special thank you to Sanjeev who was so generous with his time and energy.
متن کاملThe Quantum PCP Conjecture
The classical PCP theorem is arguably the most important achievement of classical complexity theory in the past quarter century. In recent years, researchers in quantum computational complexity have tried to identify approaches and develop tools that address the question: does a quantum version of the PCP theorem hold? The story of this study starts with classical complexity and takes unexpecte...
متن کاملWhere did you go wrong ? Errors , partial errors , and the nature information processing of human
Human performance is seldom perfect, and even when an overt response is correct it may be accompanied by partial-error activity that does not achieve the leve1 of a complete incorrect response. Partial errors can be detected in measures of the lateralized readiness potential, of the electromyogram, and of response force. Correct responses accompanied by partial errors tend to have slower reacti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Quantum Information & Computation
دوره 11 شماره
صفحات -
تاریخ انتشار 2011